Minimum distance functions of complete intersections

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Footprint functions of complete intersections

We study the minimum distance function of a complete intersection graded ideal in a polynomial ring with coefficients in a field. For graded ideals of dimension one, whose initial ideal is a complete intersection, we use the footprint function to give a sharp lower bound for the minimum distance function. Then we show some applications to coding theory.

متن کامل

Poles of Zeta Functions of Complete Intersections

A vanishing theorem is proved for`-adic cohomology with compact support on a singular aane complete intersection. As an application, it is shown that for an aane complete intersection deened over a nite eld of q elements, the reciprocal \poles" of the zeta function are always divisible by q as algebraic integers. A p-adic proof is also given, which leads to further q-divisibility of the poles o...

متن کامل

Generalized minimum distance functions

We study the r-th generalized minimum distance function (gmd function for short) and the corresponding generalized footprint function of a graded ideal in a polynomial ring over a field. If X is a set of projective points over a finite field and I(X) is its vanishing ideal, we show that the gmd function and the Vasconcelos function of I(X) are equal to the r-th generalized Hamming weight of the...

متن کامل

Criteria for complete intersections

We establish two criteria for certain local algebras to be complete intersections. These criteria play an important role in A. Wiles’s proof that all semi-stable elliptic curves over Q are modular. Introduction In this paper we discuss two results in commutative algebra that are used in A. Wiles’s proof that all semi-stable elliptic curves over Q are modular [11]. We first fix some notation tha...

متن کامل

Intersections of Sets of Distance

We isolate conditions on the relative asymptotic size of sets of natural numbers A,B that guarantee a nonempty intersection of the corresponding sets of distances. Such conditions apply to a large class of zero density sets. We also show that a variant of Khintchine’s Recurrence Theorem holds for all infinite sets A = {a1 < a2 < . . .} where ann n3/2.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra and Its Applications

سال: 2018

ISSN: 0219-4988,1793-6829

DOI: 10.1142/s0219498818502043